package leetcodeHis.链表;

/**
 * 简单
 */
public class 链表相交 {

    private static class ListNode {
        int val;
        ListNode next;
        ListNode(int val) {
            this.val = val;
            this.next = null;
        }
    }

    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        return null;
    }



}
